A two-step circle detection algorithm from the intersecting chords
نویسندگان
چکیده
This paper proposes a two-step circle detection algorithm using pairs of chords. It is shown how a pair of two intersecting chords locates the center of the circle. Based on this idea, in the ®rst step, a 2D Hough transform (HT) method is employed to ®nd the centers of the circles in the image. In the second step, a 1D radius histogram is used to compute the radii. The experimental results demonstrate that the proposed method can detect the circles eectively.
منابع مشابه
Circle Detection Method Using the Intersecting Chords
A two-step circle detection method using pairs of chords is proposed. It is shown how the center of the circle is computed from two intersecting chords. First, a 2D HT method based on the idea finds the centers of the circles in the image. Then, a 1D radius histogram is used to compute the radii. The experimental results show that the proposed method detects the circles effectively.
متن کاملCircular and Circle Trapezoid Graphs
Along with the direction that generalizes interval graphs and permutation graphs to trapezoid graphs, researchers are now trying to generalize the class known as trapezoid graphs. A circle trapezoid is the region in a circle that lies between two non-crossing chords; thus, circle trapezoid graphs are the intersecting graphs of circle trapezoids within a circle. It should be noted that circle tr...
متن کاملIntersecting Chords Theorem
This entry provides a geometric proof of the intersecting chords theorem. The theorem states that when two chords intersect each other inside a circle, the products of their segments are equal. After a short review of existing proofs in the literature [1, 3–5], I decided to use a proof approach that employs reasoning about lengths of line segments, the orthogonality of two lines and Pythagoras ...
متن کاملCircle detection using isosceles triangles sampling
Detection of circular objects in digital images is an important problem in several vision applications. Circle detection using randomized sampling has been developed in recent years to reduce the computational intensity. Randomized sampling, however, is sensitive to noise that can lead to reduced accuracy and false-positive candidates. This paper presents a new circle detection method based upo...
متن کاملThe Complexity of Colouring Circle Graphs
We study the complexity of the colouring problem for circle graphs. We will solve the two open questions of [Un88], where first results were presented. 1. Here we will present an algorithm which solves the 3-colouring problem of circle graphs in time O(n log(n)). In [Un88] we showed that the 4-colouring problem for circle graphs is NP-complete. 2. If the largest clique of a circle graph has siz...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Pattern Recognition Letters
دوره 22 شماره
صفحات -
تاریخ انتشار 2001